Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

نویسندگان

  • Hanif D. Sherali
  • Fred Glover
چکیده

Extending our work on second-order cover cuts [F. Glover, H.D. Sherali, Second-order cover cuts, Mathematical Programming (ISSN: 0025-561

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 0-1 Knapsack problem with a single continuous variable

Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure ...

متن کامل

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

M by addressing probabilistic 0–1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can be extended with a single variable is NP-hard. We describe and compare a number of exact and heuristic sepa...

متن کامل

Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem

This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which is a knapsack problem with precedence constraints imposed on the set of variables. The problem itself appears in many applications. Moreover, since the precedence constraints appear in many important integer programming problems, the polyhedral results can be used to develop cutting-plane algorit...

متن کامل

Second-order cover inequalities

We introduce a new class of second-order cover inequalities whose members are generally stronger than the classical knapsack cover inequalities that are commonly used to enhance the performance of branch-and-cut methods for 0–1 integer programming problems. These inequalities result by focusing attention on a single knapsack constraint in addition to an inequality that bounds the sum of all var...

متن کامل

A note on polyhedral aspects of a robust knapsack problem

The robust optimization framework proposed by Bertsimas and Sim can take account of data uncertainty in linear programs. The current paper investigates the polyhedral impacts of this robust model for the 0-1 knapsack problem. In particular, classical cover cuts are adapted to provide valid inequalities for the robust knapsack problem. The strength of the proposed inequalities is highlighted fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Optimization

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2008